FPGA Implementation of Novel Reconfigurable Pipelined Architectures for Low Complexity FIR Filters
نویسنده
چکیده
The Finite Impulse Response (FIR) filters require two main factors known as low complexity and reconfigurability. The FIR filters are widely applied in multistandard wireless communications. The two significant factors that are achieved by proposing two main architectures namely Constant Shift Method (CSM) and Programmable Shift Method (PSM). The major factor of filter complexity is number of adders requires in the multiplier unit. The Common Sub-expression Elimination (CSE) algorithm used to efficiently reduce the number of adders in the multiplier unit and the introduction of the Canonical Signed Digit method (CSD) to implement the low complexity higher order FIR filter is proposed in this paper. The design results shows that the proposed architectures offers a good area and power reductions compared to all other existing methods to implement FIR filters. Here compared to CSM, PSM based CSD representation for filter coefficient offers a good area and power reduction with the cost of little high delay. To reduce the delay in PSM we are going to introduce a new architecture named as pipelined PSM architecture. The pipelined PSM architecture is efficiently reduce the area and power with less delay.
منابع مشابه
Area Efficient and Low Power Reconfiurable Fir Filter
PSM architecture synthesizes multiplier blocks with low hardware requirement suitable for implementation as part of full parallel finite impulse response (FIR) filters is presented in this paper. FIR digital filters are widely used in DSP by the virtue of its stability, linear phase, fewer finite precision error and efficient implementation. In this paper, new reconfigurable architectures of lo...
متن کاملAnalysis of Efficient Architectures for FIR Filters using Common Subexpression Elimination Algorithm
Finite Impulse Response (FIR) filters are widely applied in multistandard wireless communications. The two key requirements of FIR filters are reconfigurability and low complexity. In this paper, two reconfigurable FIR filter architectures are proposed, namely Constant Shift Method [CSM] and Programmable Shift Method [PSM]. The complexity of linear phase FIR filters is dominated by the number o...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملTranspose Form Block Fir Filter Configuration for Area Delay Efficient Realization of Reconfigurable Applications
Transpose form finite-impulse response (FIR) filters are inherently pipelined and support multiple constant multiplications (MCM) technique that results in significant saving of computation. However, transpose form configuration does not directly support the block processing unlike direct form configuration. In this paper, we explore the possibility of realization of block FIR filter in transpo...
متن کاملEfficient VLSI Architectures for FIR Filters
The Finite Impulse Response (FIR) filters are widely used in many Digital Signal Processing (DSP) applications. For these applications, the low power, less area, high speed and low complexity FIR filter architectures are required. The researchers have proposed many FIR filters to meet the above design specifications. This paper is focused on the some efficient reconfigurable FIR filter architec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013